Hamiltonian properties of Toeplitz graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamiltonian properties of Toeplitz graphs

Condit ions are given for the existence of hamiltonian paths and cycles in the so-called Toeplitz graphs, i.e. simple graphs with a symmetric Toeplitz adjacency matrix.

متن کامل

On hamiltonian Toeplitz graphs

In this paper we will consider hamiltonian properties of so-called Toeplitz graphs, which are defined as follows: Definition 1 Let n,m, a1, . . . , am ∈ N, 0 < a1 < · · · < am < n and V := {0, . . . , n− 1}. Define E := {[i, j] ∈ V 2 : ∃k ∈ {1, . . . , m} : |j − i| = ak}. Then the graph (V,E) with set of vertices V and set of edges E is called an undirected Toeplitz graph with entries (or strip...

متن کامل

Hamiltonian Cycles in Directed Toeplitz Graphs

Hamiltonian Cycles in Directed Toeplitz Graphs Dr Shabnam Malik Faculty of Mathematics, Forman Christian College University, Lahore Pakistan An (n × n) matrix A = (aij) is called a Toeplitz matrix if it has constant values along all diagonals parallel to the main diagonal. A directed Toeplitz graph is a digraph with Toeplitz adjacency matrix. In this talk I will discuss conditions for the exist...

متن کامل

Hamiltonian properties of triangular grid graphs

A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-connected, linearly convex triangular grid graphs (with the exception of one of them) are hamiltonian. The only exception is a graph D which is the linearlyconvex hull of the Star of David. We extend this result to a wider...

متن کامل

Some Hamiltonian Properties of One-Conflict Graphs

Dirac’s and Ore’s conditions (1952 and 1960) are well known and classical sufficient conditions for a graph to contain a Hamiltonian cycle and they are generalized in 1976 by the Bondy-Chvtal Theorem. In this paper, we add constraints, called conflicts. A conflict in a graph G is a pair of distinct edges of G. We denote by (G, Conf) a graph G with a set of conflicts Conf . A path without confli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1996

ISSN: 0012-365X

DOI: 10.1016/0012-365x(95)00111-9